Sturmian numeration systems and decompositions to palindromes

نویسنده

  • Anna E. Frid
چکیده

We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number n better reflect the structure of the associated Sturmian word. In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian words and thus to prove for Sturmian words the following conjecture stated in 2013 by Puzynina, Zamboni and the author: If a word is not periodic, then for every Q > 0 it has a prefix which cannot be decomposed to a concatenation of at most Q palindromes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Palindromes in Sturmian Words

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

متن کامل

Combinatorial Properties of Sturmian Palindromes

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

متن کامل

Occurrence and Lexicographic Properties of Standard Sturmian Words

Standard Sturmian words form an interesting class of structurally highly compressible strings. represented by simple recurrences. We show that simplicity of representation implies new algorithmic results: the compressed string matching for such words can be solved by very special algorithms and the output is simply characterized. Each standard Sturmian word w has Occurrence Shift Property: the ...

متن کامل

Sturmian graphs and integer representations over numeration systems

In this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural ...

متن کامل

Palindromes and Two-Dimensional Sturmian Sequences

This paper introduces a two-dimensional notion of palindrome for rectangular factors of double sequences: these palindromes are deened as centrosym-metric factors. This notion provides a characterization of two-dimensional Sturmian sequences in terms of two-dimensional palindromes, generalizing to double sequences the results in 12].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.11553  شماره 

صفحات  -

تاریخ انتشار 2017